Monte Carlo Temperature Discovery Search for Combinatorial Games
نویسندگان
چکیده
منابع مشابه
High-Diversity Monte-Carlo Tree Search
For combinatorial search in single-player games nested Monte-Carlo search is an apparent alternative to algorithms like UCT that are applied in two-player and general games. To trade exploration with exploitation the randomized search procedure intensifies the search with increasing recursion depth. If a concise mapping from states to actions is available, the integration of policy learning has...
متن کاملThe Combinatorial Multi-Armed Bandit Problem and Its Application to Real-Time Strategy Games
Game tree search in games with large branching factors is a notoriously hard problem. In this paper, we address this problem with a new sampling strategy for Monte Carlo Tree Search (MCTS) algorithms, called Naı̈ve Sampling, based on a variant of the Multi-armed Bandit problem called the Combinatorial Multi-armed Bandit (CMAB) problem. We present a new MCTS algorithm based on Naı̈ve Sampling call...
متن کاملA Statistical Mechanical Approach to Combinatorial Chemistry
An analogy between combinatorial chemistry and Monte Carlo computer simulation is pursued. Examples of how to design libraries for both materials discovery and protein molecular evolution are given. For materials discovery, the concept of library redesign, or the use previous experiments to guide the design of new experiments, is introduced. For molecular evolution, examples of how to use ``bia...
متن کاملMonte-Carlo Approximation of Temperature
Monte-Carlo tree search is a powerful paradigm for the game of Go. We propose to use Monte-Carlo tree search to approximate the temperature of a game, using the mean result of the playouts. Experimental results on the sum of five 7x7 Go games show that it improves much on a global search algorithm.
متن کاملMonte-Carlo Proof-Number Search for Computer Go
In the last decade, proof-number search and Monte-Carlo methods have successfully been applied to the combinatorial-games domain. Proof-number search is a reliable algorithm. It requires a well defined goal to prove. This can be seen as a disadvantage. In contrast to proof-number search, Monte-Carlo evaluation is a flexible stochastic evaluation for game-tree search. In order to improve the eff...
متن کامل